Optimized Evaluation of Box Splines via the Inverse FFT
نویسنده
چکیده
Box splines are a multivariate extension of uniform univariate B-splines. Direct evaluation of a box spline basis function can be difficult , but they have a relatively simple Fourier transform and can therefore be evaluated with an inverse FFT. Symmetry, recursive evaluation of the coefficients, and parallelization can be used to optimize performance. A windowing function can also be used to reduce truncation artifacts. We explore all these options in the context of a high-performance parallel implementation. Our goal is the provision of an empirical touchstone for the inverse FFT evaluation of box spline basis fun ctions.
منابع مشابه
Efficient volume rendering on the body centered cubic lattice using box splines
We demonstrate that non-separable box splines deployed on body centered cubic lattices (BCC) are suitable for fast evaluation on present graphics hardware. Therefore, we develop the linear and quintic box splines using a piecewise polynomial (pp)-form as opposed to their currently known basis (B)-form. The pp-form lends itself to efficient evaluation methods such as de Boor’s algorithm for spli...
متن کاملFast and stable evaluation of box-splines via the Bézier form
To repeatedly evaluate linear combinations of box-splines in a fast and stable way, in particular along knot planes, we convert to and tabulate the box-spline as piecewise polynomials in Bézier form. We show that the Bézier coefficients can be stored as integers and a rational scale factor and derive a hash table for efficiently accessing the Bézier pieces. The preprocessing, the resulting eval...
متن کاملFast Computation by Subdivision of Multidimensional Splines and Their Applications
We present theory and algorithms for fast explicit computations of uniand multi-dimensional periodic splines of arbitrary order at triadic rational points and of splines of even order at diadic rational points. The algorithms use the forward and the inverse Fast Fourier transform (FFT). The implementation is as fast as FFT computation. The algorithms are based on binary and ternary subdivision ...
متن کاملConstrained Interpolation via Cubic Hermite Splines
Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation. It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...
متن کاملInvestigation of electron and hydrogenic-donor states confined in a permeable spherical box using B-splines
Effects of quantum size and potential shape on the spectra of an electron and a hydrogenic-donor at the center of a permeable spherical cavity have been calculated, using linear variational method. B-splines have been used as basis functions. By extensive convergence tests and comparing with other results given in the literature, the validity and efficiency of the method were confirmed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015